Polling systems with batch service

Polling with batch service

This paper considers a batch service polling system. We first study the case in which the server visits the queues cyclically, considering three different service regimes: gated, exhaustive, and globally gated. We subsequently analyze the case (the so called ‘Israeli Queue’) in which the server first visits the queue with the ‘oldest’ customer. In both cases, queue lengths and waiting times are...

Time-limited polling systems with batch arrivals and phase-type service times

In this paper, we develop a general framework to analyze polling systems with either the autonomous-server or the time-limited service discipline. According to the autonomous-server discipline, the server continues servicing a queue for a certain period of time. According to the time-limited service discipline, the server continues servicing a queue for a certain period of time or until the que...

Optimal batch service of a polling system under partial information

We consider the optimal scheduling of an infinite.capacity batch server in a N-node ring queueing network, where the controller observes only the length of the queue at which the server is located. For a cost criterion that includes linear holding costs, fixed dispatching costs, and linear service rewards, we prove optimality and monotonicity of threshold scheduling policies.

Dynamic visit-order rules for batch-service polling

On two-queue Markovian polling systems with exhaustive service

We consider a class of two-queue polling systems with exhaustive service, where the order in which the server visits the queues is governed by a discrete-time Markov chain. For this model, we derive an expression for the probability generating function of the joint queue length distribution at polling epochs. Based on these results, we obtain explicit expressions for the Laplace-Stieltjes trans...